Automated Modular Termination Proofs for Real Prolog Programs

Modular Termination Proofs for Logic and Pure Prolog Programs

We provide a uniform and simpliied presentation of the methods of Bezem Bez93] ((rst published as Bez89]) and of Apt and Pedreschi AP93] ((rst published as AP90]) for proving termination of logic and Prolog programs. Then we show how these methods can be reened so that they can be used in a modular way.

Automated termination analysis for logic programs with cut

Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, whereas real-world Prolog programs typically use the cut operator. We introduce a novel pre-processing method which automatically transforms Prolog programs into logic programs without cuts, where termination of the cut-fre...

Modular Termination Proofs for Prolog with Tabling

Automated Complexity Analysis for Prolog by Term Rewriting

For term rewrite systems (TRSs), a huge number of automated termination analysis techniques have been developed during the last decades, and by automated transformations of Prolog programs to TRSs, these techniques can also be used to prove termination of Prolog programs. Very recently, techniques for automated termination analysis of TRSs have been adapted to prove asymptotic upper bounds for ...

A Theory of First - Order Built - in ' s of PrologKrzysztof

We provide here a framework for studying Prolog programs with various built-in's that include arithmetic operations, and such metalogical relations like var and ground. To this end we propose a new, declarative semantics and prove completeness of the Prolog computation mechanism w.r.t. this semantics. Finally, we provide a method for proving termination of Prolog programs with built-in's which ...